منابع مشابه
The Unified Theory of Pseudorandomness
Pseudorandomness is the theory of efficiently generating objects that “look random” despite being constructed with little or no randomness. One of the achievements of this research area has been the realization that a number of fundamental and widely studied “pseudorandom” objects are all almost equivalent when viewed appropriately. These objects include pseudorandom generators, expander graphs...
متن کاملthe analysis of the role of the speech acts theory in translating and dubbing hollywood films
از محوری ترین اثراتی که یک فیلم سینمایی ایجاد می کند دیالوگ هایی است که هنرپیش گان فیلم میگویند. به زعم یک فیلم ساز, یک شیوه متأثر نمودن مخاطب از اثر منظوره نیروی گفتارهای گوینده, مثل نیروی عاطفی, ترس آور, غم انگیز, هیجان انگیز و غیره, است. این مطالعه به بررسی این مسأله مبادرت کرده است که آیا نیروی فراگفتاری هنرپیش گان به مثابه ی اعمال گفتاری در پنج فیلم هالیوودی در نسخه های دوبله شده باز تولید...
15 صفحه اولUnified Oblivious-RAM: Improving Recursive ORAM with Locality and Pseudorandomness
Oblivious RAM (ORAM) is a cryptographic primitive that hides memory access patterns to untrusted storage. ORAM may be used in secure processors for encrypted computation and/or software protection. While recursive Path ORAM is currently the most practical ORAM for secure processors, it still incurs large performance and energy overhead and is the performance bottleneck of recently proposed secu...
متن کاملPseudorandomness for Permutation Branching Programs Without the Group Theory
The typical way we derandomize a randomized computation is to replace the truly random bits used by the computation with suitable pseudorandom bits. We require that using pseudorandom, rather than truly random, bits does not change the output of the computation with probability more than ε; we call this parameter the error. The algorithm that produces the pseudorandom bits is called a pseudoran...
متن کاملDimension, Pseudorandomness and Extraction of Pseudorandomness
In this paper we propose a quantification of ensemble of distributions on a set of strings, in terms of how close to pseudorandom a distribution is. The quantification is an adaptation of the theory of dimension of sets of infinite sequences introduced by Lutz. Adapting Hitchcock’s work, we also show that the logarithmic loss incurred by a predictor on an ensemble of distributions is quantitati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGACT News
سال: 2007
ISSN: 0163-5700
DOI: 10.1145/1324215.1324225